Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs
نویسندگان
چکیده
A graph admitting a perfect matching has the Perfect-Matching-Hamiltonian property (for short PMH-property) if each of its matchings can be extended to Hamiltonian cycle. In this paper we establish some sufficient conditions for $G$ in order guarantee that line $L(G)$ PMH-property. particular, prove happens when is (i) with maximum degree at most $3$, (ii) complete graph, or (iii) an arbitrarily traceable graph. Further related questions and open problems are proposed along paper.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملPerfect matchings and Hamiltonian cycles in the preferential attachment model
We study the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model. In this model, vertices are added to the graph one by one, and each time a new vertex is created it establishes a connection with m random vertices selected with probabilities proportional to their current degrees. (Constant m is the only parameter of the model.) We prove that if m ≥ 1,260, ...
متن کاملOn Perfect Matchings and Hamiltonian Cycles in Sumsof Random
We prove that the sum of two random trees almost surely possesses a perfect matching and the sum of ve random trees almost surely possesses a Hamiltonian cycle.
متن کاملPerfect matchings and Hamiltonian cycles in the preferential attachment model
In this paper, we study the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model. In this model, vertices are added to the graph one by one, and each time a new vertex is created it establishes a connection with m random vertices selected with probabilities proportional to their current degrees. (Constant m is the only parameter of the model.) We prove that...
متن کاملEntropy bounds for perfect matchings and Hamiltonian cycles
For a graph G = (V,E) and x : E → < satisfying ∑ e3v xe = 1 for each v ∈ V , set h(x) = ∑ e xe log(1/xe) (with log = log2). We show that for any n-vertex G, random (not necessarily uniform) perfect matching f satisfying a mild technical condition, and xe = Pr(e ∈ f), H(f) < h(x)− n 2 log e+ o(n) (where H is binary entropy). This implies a similar bound for random Hamiltonian cycles. Specializin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2021
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/9143